Chinese translation for "vertex set"
|
- 顶点集
Related Translations:
- Example Sentences:
| 1. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency .
如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。 | | 2. | A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
一个求外平面图最小反馈点集的多项式时间算法 | | 3. | Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency
如果在两个图之间存在一个保持邻接性的1 - 1对应，则这两个图是同构的。 | | 4. | A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph
摘要若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。 | | 5. | A series of recent papers has aimed at giving good bounds of feedback vertex set for families of graphs broadly known as : butterflies , hypercubes , meshes , star graphs , and so on
摘要最近诸多文章旨在讨论关于反馈结点集的上下界问题，比如：蝴蝶网、超立方体、网格、星图等等。 | | 6. | Compare to existing results for general graph , new lower bound on the size of the minimum feedback vertex set of ( n , k ) - star graph is given based on its special structure
本文主要讨论了关于组合星图反馈结点集的下界问题，在基于组合星图的性质和已有相关结果的基础上，给出了组合星图反馈结点集的新的下界。 | | 7. | Basic graph is a graph for which basis set of matroid is consisting of vertex set . two vertexs are adjoining if and only if there are exactly p ( m ) - l commonality elements in their bases . thus it plays an important role in the further studying
基图是一个以拟阵的基集为顶点集的图，使图中的两个顶点是邻接的当且仅当这两个顶点对应的基恰好有p ( m ) - 1个公共元。 | | 8. | Since 1988 vince proposed the conception of star - chromatic number , a large amount of study about star - chromatic number , circular chromatic number and the way to do study have been achieved . then graph g were produced . lt has vertex set { 0 , 1 , 2 , . . . ,
1988年， vince提出星色数的概念之后，得到了大量的关于星色数、圈色数的研究。引出了一类特殊的图： g _ d ~ k图，它有点集{ 0 ， 1 ， 2 ， | | 9. | Based on the hoppe ' s progressive mesh generation algorithm , restrict the simplified mesh model ’ s vertices to the initial mesh model ' s vertex set , when refinement sequence is generated . this can reduce the information included in the refinement sequence
在hoppe渐进网格生成算法的基础上,在生成细化序列时,将简化网格模型的顶点局限于初始网格模型的顶点集合中,减少了细化序列所包含的信息。 | | 10. | Petersen graph is well known in graph theory , a generalized petersen graph , denoted by f ( m , a ) , is defined as follows : its vertex set is u u w , where u - { < / 0 . ? , ? ? ? um - i ] , w ? [ w0 , wi , ? ? ? wm - i } , its edges are given by ( u ; , wi ) , ( ui
Petersen图是图论中我们熟知的图，广义petersen图，记为p ( m ， a ) ，是有2m个顶点的图，其顶点集为，边有点对和给出，这里下标的运算都是在模m下的运算 |
- Similar Words：
- "vertex power" Chinese translation, "vertex presentation" Chinese translation, "vertex projection direction" Chinese translation, "vertex properties" Chinese translation, "vertex round" Chinese translation, "vertex shaders" Chinese translation, "vertex sharp transient wave" Chinese translation, "vertex sharp wave" Chinese translation, "vertex shartransients, vertex sharwaves" Chinese translation, "vertex standard" Chinese translation
|
|
|
